An Expansion Formula in the Group Algebra of Signed Permutations
نویسنده
چکیده
Let Va be the element (defined more precisely in the paper) of the group algebra Q(S n ) which describes the action of taking the first a cards out of a deck of n cards and then inserting these cards back into the deck either upright or flipped. We prove that
منابع مشابه
Labeled partitions with colored permutations
In this paper, we extend the notion of labeled partitions with ordinary permutations to colored permutations in the sense that the colors are endowed with a cyclic structure. We use labeled partitions with colored permutations to derive the generating function of the fmajk indices of colored permutations. The second result is a combinatorial treatment of a relation on the q-derangement numbers ...
متن کاملMacMahon-type Identities for Signed Even Permutations
MacMahon’s classic theorem states that the length and major index statistics are equidistributed on the symmetric group Sn. By defining natural analogues or generalizations of those statistics, similar equidistribution results have been obtained for the alternating group An by Regev and Roichman, for the hyperoctahedral group Bn by Adin, Brenti and Roichman, and for the group of even-signed per...
متن کاملOn some classes of expansions of ideals in $MV$-algebras
In this paper, we introduce the notions of expansion of ideals in $MV$-algebras, $ (tau,sigma)- $primary, $ (tau,sigma)$-obstinate and $ (tau,sigma)$-Boolean in $ MV- $algebras. We investigate the relations of them. For example, we show that every $ (tau,sigma)$-obstinate ideal of an $ MV-$ algebra is $ (tau,sigma)$-primary and $ (tau,sigma)$-Boolean. In particular, we define an expansion $ ...
متن کاملTwo Involutions for Signed Excedance Numbers
Two involutions on permutations and derangements are constructed. They lead to a direct evaluation of some signed Eulerian polynomials on permutations and derangements. The latter formulas, combined with the exponential formula, give a new derivation of the corresponding generating functions.
متن کاملRestricted Single or Double Signed Patterns
Let E n = {[τ ]a = (τ (a1) 1 , . . . , τ (an) n )|τ ∈ Sn, 1 ≤ ai ≤ r} be the set of all signed permutations on the symbols 1, 2, . . . , n with signs 1, 2, . . . , r. We prove, for every 2-letter signed pattern [τ ]a, that the number of [τ ]a-avoiding signed permutations in E n is given by the formula n ∑ j=0 j!(r−1) ( n j 2 . Also we prove that there are only one Wilf class for r = 1, four Wil...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014